A weak group inverse for rectangular matrices
نویسندگان
چکیده
منابع مشابه
On group inverse of singular Toeplitz matrices
In this paper we show that the group inverse of a real singular Toeplitz matrix can be represented as the sum of products of lower and upper triangular Toeplitz matrices. Such a matrix representation generalizes “Gohberg–Semencul formula” in the literature. © 2004 Elsevier Inc. All rights reserved. AMS classification: 15A09; 65F20
متن کاملSparsiication of Rectangular Matrices
Given a rectangular matrix with more columns than rows, nd a base of linear combinations of the row vectors such that these contain as many zero entries as possible. This process is called \sparsiication" (of the matrix). A combinatorial search method to solve sparsiication is presented which needs exponentially many arithmetic operations (in terms of the size of the matrix). However, various p...
متن کاملPseudospectra of rectangular matrices
Pseudospectra of rectangular matrices vary continuously with the matrix entries, a feature that eigenvalues of these matrices do not have. Some properties of eigenvalues and pseudospectra of rectangular matrices are explored, and an efficient algorithm for the computation of pseudospectra is proposed. Applications are given in (square) eigenvalue computation (Lanczos iteration), square pseudosp...
متن کاملGroup Inverse and Generalized Drazin Inverse of Block Matrices in a Banach Algebra
Let A be a complex unital Banach algebra with unit 1. The sets of all invertible and quasinilpotent elements (σ(a) = {0}) of A will be denoted by A and A, respectively. The group inverse of a ∈ A is the unique element a ∈ A which satisfies aaa = a, aaa = a, aa = aa. If the group inverse of a exists, a is group invertible. Denote by A the set of all group invertible elements of A. The generalize...
متن کاملCommunication-avoiding Cholesky-QR2 for rectangular matrices
The need for scalable algorithms to solve least squares and eigenvalue problems is becoming increasingly important given the rising complexity of modern machines. We address this concern by presenting a new scalable QR factorization algorithm intended to accelerate these problems for rectangular matrices. Our contribution is a communication-avoiding distributed-memory parallelization of an exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas
سال: 2019
ISSN: 1578-7303,1579-1505
DOI: 10.1007/s13398-019-00674-9